Magic Sets for disjunctive Datalog programs
نویسندگان
چکیده
منابع مشابه
Magic Sets for Disjunctive Datalog Programs
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented. The technique exploits the propagation of query bindings and extends the Magic Set optimization technique (originally defined for non-disjunctive programs). An important feature of disjunctive Datalog programs is nonmonotonicity, which calls f...
متن کاملDynamic Magic Sets for Disjunctive Datalog Programs
Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negation in bodies. Magic Sets are a technique for optimizing query answering over logic programs and have been originally defined for standard Datalog, that is, ASP without disjunction and negation. Essentially, the input program is...
متن کاملEnhancing the Magic-Set Method for Disjunctive Datalog Programs
We present a new technique for the optimization of (partially) bound queries over disjunctive datalog programs. The technique exploits the propagation of query bindings, and extends the Magic-Set optimization technique (originally defined for non-disjunctive programs) to the disjunctive case, substantially improving on previously defined approaches. Magic-Set-transformed disjunctive programs fr...
متن کاملMagic-Sets for Datalog with Existential Quantifiers
Datalog∃ is the extension of Datalog allowing existentially quantified variables in rule heads. This language is highly expressive and enables easy and powerful knowledge-modelling, but the presence of existentially quantified variables makes reasoning over Datalog∃ undecidable in the general case. Restricted classes of Datalog∃, such as Shy, have been proposed in the literature with the aim of...
متن کاملDatalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
We study the problem of rewriting a Disjunctive Datalog program into an equivalent plain Datalog program (i.e., one that entails the same facts for every dataset). We show that a Disjunctive Datalog program is Datalog rewritable if and only if it can be rewritten into a linear program (i.e., having at most one IDB body atom in each rule), thus providing a novel characterisation of Datalog rewri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2012
ISSN: 0004-3702
DOI: 10.1016/j.artint.2012.04.008